منابع مشابه
Asymptotic Approximation of Convex Curves
L. Fejes Tóth gave asymptotic formulae as n → ∞ for the distance between a smooth convex disc and its best approximating inscribed or circumscribed polygons with at most n vertices, where the distance is in the sense of the symmetric difference metric. In this paper these formulae are extended by specifying the second terms of the asymptotic expansions. Tools are from affine differential geometry.
متن کاملAsymptotic Approximation of Convex Curves; the Hausdorff Metric Case
where κ(t) is the curvature of C given as a function of the arclength t and l the length of C. See also McClure and Vitale [7] and for asymptotic formulae for approximation with respect to the Hausdorff metric in higher dimensions R. Schneider [8],[9] and P.M. Gruber [5]. In this article we extend the asymptotic formulae (1) by deriving the second terms in the asymptotic expansions of δ(C,P i n...
متن کاملAsymptotic Approximation by Quadratic Spline Curves
For a planar curve C with positive affine curvature, we derive an asymptotic formula for the area approximation by quadratic spline curves with n knots lying on C. The order of approximation is 1/n4 and the formula depends on an integral over the affine curvature. 1991 AMS subject classification: 52A10, 53A04, 53A15, 41A15, 41A50
متن کاملAsymptotic approximation of smooth convex bodies by general polytopes
For the optimal approximation of convex bodies by inscribed or circumscribed polytopes there are precise asymptotic results with respect to different notions of distance. In this paper we want to derive some results on optimal approximation without restricting the polytopes to be inscribed or circumscribed. Let Pn and P(n) denote the set of polytopes with at most n vertices and n facets, respec...
متن کاملRates of Convex Approximation
This paper deals with sparse approximations by means of convex combinations of elements from a predetermined \basis" subset S of a function space. Speciically, the focus is on the rate at which the lowest achievable error can be reduced as larger subsets of S are allowed when constructing an approximant. The new results extend those given for Hilbert spaces by Jones and Barron, including in par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archiv der Mathematik
سال: 1994
ISSN: 0003-889X,1420-8938
DOI: 10.1007/bf01189576